Balanced Bipartite Graph Based Register Allocation for Network Processors in Mobile and Wireless Networks
نویسندگان
چکیده
منابع مشابه
Balanced bipartite graph based register allocation for network processors in mobile and wireless networks
Mobile and wireless networks are the integrant infrastructure of mobile and pervasive computing that aims at providing transparent and preferred information and services for people anytime anywhere. In such environments, end-to-end network bandwidth is crucial to improve user’s transparent experience when providing on-demand services such as mobile video playing. As a result, powerful computing...
متن کاملA Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks
Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...
متن کاملRegister Allocation for VLIW DSP Processors with Irregular Register Files
A variety of new register file architectures have been developed for embedded processors in recent years, promoting hardware design to achieve low-power dissipation and reduced die size over traditional unified register file structures. This paper presents a novel register allocation scheme for a clustered VLIW DSP processor which is designed with distinctively banked register files in which po...
متن کاملRegister Allocation for Processors with Dynamically Reconfigurable Register Banks
This paper presents a method for optimizing register allocation for processors which can reconfigure their access to different register banks to increase the number of accessible registers. Register allocation like the graph coloring method of Chaitin aim at keeping a large number of values in registers and minimize the amount of necessary spill code. We extend that method in two directions: Fi...
متن کاملGlobal Register Allocation Based on Graph Fusion
A register allocator must effectively deal with three issues: live range splitting, live range spilling, and register assignment. This paper presents a new coloring-based global register allocation algorithm that addresses all three issues in an integrated way: the algorithm starts with an interference graph for each region of the program, where a region can be a basic block, a loop nest, a sup...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mobile Information Systems
سال: 2010
ISSN: 1574-017X,1875-905X
DOI: 10.1155/2010/986192